• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > ICFICE > ICFICE 2016

ICFICE 2016

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Prediction method of node movement using Markov Chain in DTNs
¿µ¹®Á¦¸ñ(English Title) Prediction method of node movement using Markov Chain in DTNs
ÀúÀÚ(Author) Il-Kyu Jeon   Kang-Whan Lee  
¿ø¹®¼ö·Ïó(Citation) VOL 08 NO. 01 PP. 0257 ~ 0258 (2016. 06)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
In this paper, we propose an algorithm to select efficient relay nodes. While most prediction algorithms assume that nodes need additional information such as node¡¯s schedule and connectivity between nodes, the network reliability is lowered when additional information is unknown. To solve this problem, this study proposes a Context-aware Markov Chain Prediction (CMCP) based on the Markov chain that uses the node¡¯s movement information without requiring additional information. The evaluation results show that the proposed scheme has competitive delivery ratio.
Å°¿öµå(Keyword) Delay Tolerant Network   Prediction   Context -awareness   Markov chain  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå